A hierarchy of deterministic top-down tree transformations
نویسندگان
چکیده
منابع مشابه
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
A query is determined by a view, if the result to the query can be reconstructed from the result of the view. We consider the problem of deciding for two given tree transformations, whether one is determined by the other. If the view transformation is induced by a tree transducer that may copy, then determinacy is undecidable, even for identity queries. For a large class of non-copying views, n...
متن کاملNode Query Preservation for Deterministic Linear Top-Down Tree Transducers
This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLTV ) and an n-ary query based on runs of a tree automaton. We say that a DLTV Tr strongly preserves a query Q if there is a query Q′ such that for every document t, the answer set of...
متن کاملDeterministic top-down tree automata: past, present, and future
In strong contrast to their non-deterministic counterparts, deterministic top-down tree automata received little attention in the scientific literature. The aim of this article is to survey recent and less recent results and stipulate new research directions for top-down deterministic tree automata motivated by the advent of the XML data exchange format. In particular, we survey different ranke...
متن کاملDeterministic Top-Down Tree Transducers with Iterated Lookahead
It is known that by iterating the look-ahead tree languages for deterministic topdown tree automata, more and more powerful recognizing devices are obtained. Let DR0 = DR, where DR is the class of all tree languages recognizable by deterministic top-down tree automata, and let, for n 1, DRn be the class of all tree languages recognizable by deterministic top-down tree automata with DRn 1 lookah...
متن کاملTop-down Deterministic Languages
Two new families of languages, the F(k) and U(k) languages, are Introduced each of which is, in some sense, a generalization of top-down deterministic languages. This leads us to new characterizations of s-grammars and LL(1) languages. We include a characterization of the unambiguous context-free languages, generalizations of the equivalence relation on s-grammars to LL(k) grammars, and a summa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1996
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01305313